Complex Tasks Allocation for Multi Robot Teams under Communication Constraints
نویسندگان
چکیده
The Multirobot Task Allocation (MRTA) paradigm is widely used in multirobot cooperation schemes, e.g. for observation, surveillance and tracking missions. Market-based approaches have yielded effective distributed solutions for such missions, showing the ability to manage heterogeneous, dynamic and robust robot teams. Two major challenges remain however poorly tackled: the management of inter-robot and inter-task communication constraints, and the use of a rich task formalism to model complex missions. This paper presents our investigations to treat these two aspects. The inter-robot and inter-task communication constraints are explicitly handled in the task allocation process, through simple geometric models and thanks to temporal scheduling skills. Rich tasks are allocated using a treebased task formalism that allows to treat complex missions with task ordering. Current work has shown it to be able to handle more complex tasks and to give better solution than MRTA systems working on simple task structures. In our work we will try to go further in this investigation.
منابع مشابه
A comprehensive taxonomy for multi-robot task allocation
Task allocation is an important aspect of many multi-robot systems. The features and complexity of multi-robot task allocation (MRTA) problems are dictated by the requirements of the particular domain under consideration. These problems can range from those involving instantaneous distribution of simple, independent tasks among members of a homogenous team, to those requiring the time-extended ...
متن کاملAuctions for robust task execution in multi-robot teams
We present an auction-based method for dynamic allocation of tasks to robots. The robots have to visit locations in a 2D environment for which they have a map. Unexpected obstacles, loss of communication, and other delays may prevent a robot from completing its allocated tasks. Therefore tasks not yet achieved are rebid every time a task has been completed. This provides an opportunity to impro...
متن کاملMonte Carlo Tree Search for Multi-Robot Task Allocation
Multi-robot teams are useful in a variety of task allocation domains such as warehouse automation and surveillance. Robots in such domains perform tasks at given locations and specific times, and are allocated tasks to optimize given team objectives. We propose an efficient, satisficing and centralized Monte Carlo Tree Search based algorithm exploiting branch and bound paradigm to solve the mul...
متن کاملExperiments on multi-robot routing with communication constraints
As field robot teams mature and their missions become more ambitious, new real world challenges become more prominent. Problems that were previously not an issue in small experimental setups, or that were typically left out in simulation, are attracting increasing interest in order to expand the applicability of such robotic teams. Communication constraints in large or cluttered scenarios, wher...
متن کاملMonte Carlo Tree Search with Branch and Bound for Multi-Robot Task Allocation
Multi-robot teams are effective in a variety of task allocation domains such as warehouse automation and surveillance. Robots in such domains have to perform tasks at given locations and specific times. Tasks have to be allocated to optimize given team objectives, such as minimizing the total distance traveled. We propose an efficient, satisficing and centralized Monte Carlo Tree Search (MCTS) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010